Comment on "Performability Analysis: A New Algorithm"
نویسندگان
چکیده
The paper “Performability Analysis: A New Algorithm” describes an algorithm for computing the complementary distribution of the accumulated reward over an interval of time in a homogeneous Markov process. In this comment, we show that in two particular cases, one of which is quite frequent, small modifications of the algorithm may reduce significantly its storage complexity.
منابع مشابه
Approximate Performability and Dependability Analysis Using Generalized Stochastic Petri Nets
Haverkort, B.R., Approximate performability and dependability analysis using generalized stochastic Petri nets, Performance Evaluation 18 (1993) 61-78. Since current day fault-tolerant and distributed computer and communicat ion systems tend to be large and complex, their corresponding performability models will suffer from the same characteristics. Therefore, calculating performability measure...
متن کاملPerformability Analysis: A New Algorithm [Brief Contributions] - Computers, IEEE Transactions on
We propose, ifl this paper, a new algorithm to compute the performability distribution. Its computational complexity is polynomial and it deals only with nonnegative numbers bounded by one. This important property allows us to determine truncation steps and so to improve the execution time of the algorithm.
متن کاملHTA – Algorithm or Process?; Comment on “Expanded HTA: Enhancing Fairness and Legitimacy”
Daniels, Porteny and Urrutia et al make a good case for the idea that that public decisions ought to be made not only “in the light of” evidence but also “on the basis of” budget impact, financial protection and equity. Health technology assessment (HTA) should, they say, be accordingly expanded to consider matters additional to safety and cost-effectiveness. They also complain that most HTA re...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملTransient Analysis of Dependability/Performability Models by Regenerative Randomization with Laplace Transform Inversion
In this paper we develop a variant of a previously proposed method (the regenerative randomization method) for the transient analysis of dependability/performability models. The variant is obtained by developing a closed-form expression for the solution of the truncated transformed model obtained in regenerative randomization and using a Laplace transform inversion algorithm. Using models of mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 59 شماره
صفحات -
تاریخ انتشار 2010